Let Should Not Be Generalised

نویسندگان

  • Dimitrios Vytiniotis
  • Simon Peyton Jones
  • Tom Schrijvers
چکیده

From the dawn of time, all derivatives of the classic Hindley-Milner type system have supported implicit generalisation of local letbindings. Yet, as we will show, for more sophisticated type systems implicit let-generalisation imposes a disproportionate complexity burden. Moreover, it turns out that the feature is very seldom used, so we propose to eliminate it. The payoff is a substantial simplification, both of the specification of the type system, and of its implementation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Angle Structures and Normal Surfaces

Let M be the interior of a compact 3–manifold with boundary, and let T be an ideal triangulation of M. This paper describes necessary and sufficient conditions for the existence of angle structures, semi–angle structures and generalised angle structures on (M ;T ) respectively in terms of a generalised Euler characteristic function on the solution space of the normal surface theory of (M ; T )....

متن کامل

مدیر موفق کیست؟

Who is a really successful manager? A manager who spends less money, or the one who earns more? A manager who can survive for a longer period of time, or an administrator who expands his organization, and opens up new branches? Which one is the most successful? The article tries to answer these questions and provides, some simple guidlines for the managers in every domain of management who wan...

متن کامل

The Equivariant Euler Characteristic of Real Coxeter Toric Varieties

Let W be a crystallographic Weyl group, and let TW be the complex toric variety attached to the fan of cones corresponding to the reflecting hyperplanes of W , and its weight lattice. The real locus TW (R) is a smooth, connected, compact manifold with a W -action. We give a formula for the Euler characteristic of TW (R) as a generalised character of W . In type An−1 for n odd, one obtains a gen...

متن کامل

On Generalised Paley Graphs and Their Automorphism Groups

The generalised Paley graphs, as the name implies, are a generalisation of the Paley graphs which are well-known to be self-complementary and arc-transitive. They are defined as follows. Let F be a finite field of order p, where p is a prime, and let S be a subgroup of the multiplicative group of F, where S must have even order if p is odd. The generalised Paley graph of F relative to S has ver...

متن کامل

On Central Root Automorphisms of Finite Generalised Hexagons

Let A be the flag complex of a generalised 2m-gon, with m 2 2, and let G be a group of special automorphisms of A. An automorphism of A is called a central root awomorphism if it fixes every vertex at distance less than or equal to m from a prescribed vertex of A. This paper begins a study of the structure of the pair (A, G), under the assumptions that G is finite and contains a central root au...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009